On rearrangeable multirate three-stage Clos networks
نویسندگان
چکیده
منابع مشابه
Monotone Routing in Multirate Rearrangeable Clos Networks
In this paper, we study monotone routing in the symmetric three-stage Clos network with general bandwidth, and propose a new approach to analyze the multirate rearrangeability. For networks with small size switches, we show that monotone routing is better than the previous methods. 2001
متن کاملA new routing algorithm for multirate rearrangeable Clos networks
In this paper, we study the problem of finding routing algorithms on the multirate rearrangeable Clos networks which use as few number of middle-stage switches as possible. We propose a new routing algorithm called the “grouping algorithm”. This is a simple algorithm which uses fewer middle-stage switches than all known strategies, given that the number of input-stage switches and output-stage ...
متن کاملOn Multirate Rearrangeable Clos Networks and a Generalized Edge Coloring Problem on Bipartite Graphs
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n; r) of middle-state switches for the symmetric 3-stage Clos network C(n;m(n; r); r) to be rearrangeable in the multirate enviroment is at most 2n 1. This problem is equivalent to a generalized version of the bipartite graph edge coloring problem. The best bounds known so far on this function m(n; r) is 11n=9 m(n;...
متن کاملMultirate Clos Networks
The Clos networks are a class of multistage switching network topologies that provide alternate paths between inputs and outputs, making it possible to minimize or eliminate the blocking that can otherwise occur in such networks. In his seminal paper in the Bell System Technical Journal in 1953, Charles Clos showed how these networks could be configured to make them nonblocking and effectively ...
متن کاملMulticast three-stage Clos networks
0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.022 * Corresponding author. Tel.: +39 0223993580. E-mail address: [email protected] (A. Pattav This paper considers three-stage switching networks able to support multicast traffic, i.e. connections in which one network inlet is connected to more than one network outlet at the same time. The non-blocking condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.12.007